Branching-Time Model Checking Gap-Order Constraint Systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Branching-Time Model Checking Gap-Order Constraint Systems (Extended Version)

We consider the model checking problem for Gap-order Constraint Systems (GCS) w.r.t. the branching-time temporal logic CTL, and in particular its fragments EG and EF. GCS are nondeterministic infinitely branching processes described by evolutions of integer-valued variables, subject to Presburger constraints of the form x−y ≥ k, where x and y are variables or constants and k ∈ N is a non-negati...

متن کامل

Branching-Time Model Checking Gap-Order Constraint Systems

We consider the model checking problem for Gap-order Constraint Systems (GCS) w.r.t. the branching-time temporal logic CTL, and in particular its fragments EG and EF. GCS are nondeterministic infinitely branching processes described by evolutions of integer-valued variables, subject to Presburger constraints of the form x−y ≥ k, where x and y are variables or constants and k ∈ N is a non-negati...

متن کامل

Explorer Branching - Time Model Checking Gap - Order Constraint Systems

We consider the model checking problem for Gap-order Constraint Systems (GCS) w.r.t. the branching-time temporal logic CTL, and in particular its fragments EG and EF. GCS are nondeterministic infinitely branching processes described by evolutions of integer-valued variables, subject to Presburger constraints of the form x− y ≥ k, where x and y are variables or constants and k ∈ N is a non-negat...

متن کامل

A Partial Order Approach to Branching Time Logic Model Checking

Part.ial order t.echniques enable reducing the size of I.Iw sl,ate gtoaph used for model checking, thus alleviating the 'state space explosion' problem. Tilt'sf.' reductions are based on selecting a subset of the enabled operations from each program 51.ale. So far. these methods have been studied, implemel~ted and demonst.rat.ed fol' assertional langllagcs t.hat. model t.he executions of a prog...

متن کامل

Model checking dynamic epistemics in branching time

We give a relation between a logic of knowledge and change, with a semantics on Kripke models, and a logic of knowledge and time, with a semantics on interpreted systems. More in particular, given an epistemic state and a formula in action model logic, we construct an interpreted system relative to that epistemic state and that formula that satisfies the translation of the formula into branchin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fundamenta Informaticae

سال: 2016

ISSN: 0169-2968,1875-8681

DOI: 10.3233/fi-2016-1317